Automatic Heuristic Construction in a Complete General Game Player
نویسندگان
چکیده
Computer game players are typically designed to play a single game: today’s best chess-playing programs cannot play checkers, or even tic-tac-toe. General Game Playing is the problem of designing an agent capable of playing many different previously unseen games. The first AAAI General Game Playing Competition was held at AAAI 2005 in order to promote research in this area. In this article, we survey some of the issues involved in creating a general game playing system and introduce our entry to that event. The main feature of our approach is a novel method for automatically constructing effective search heuristics based on the formal game description. Our agent is fully implemented and tested in a range of different games.
منابع مشابه
In Proceedings of the Twenty - First National Conference on Artificial Intelligence ( AAAI - 06 ) , Boston , MA , July 2006 . Automatic Heuristic Construction in a Complete General Game Player ∗
Computer game players are typically designed to play a single game: today’s best chess-playing programs cannot play checkers, or even tic-tac-toe. General Game Playing is the problem of designing an agent capable of playing many different previously unseen games. The first AAAI General Game Playing Competition was held at AAAI 2005 in order to promote research in this area. In this article, we ...
متن کاملGeneral Game Playing with Ants
General Game Playing (GGP) aims at developing game playing agents that are able to play a variety of games and, in the absence of pre-programmed game specific knowledge, become proficient players. The challenge of making such a player has led to various techniques being used to tackle the problem of game specific knowledge absence. Most GGP players have used standard tree-search techniques enha...
متن کاملAutomatic Heuristic Construction for General Game Playing
Introduction Creating programs that can play games such as chess, checkers, and backgammon, at a high level has long been a challenge and benchmark for AI. While several game-playing systems developed in the past, such as Deep Blue (Campbell, Jr., & Hsu 2002), Chinook (Schaeffer et al. 1992), and TD-gammon (Tesauro 1994) have demonstrated competitive play against human players, such systems are...
متن کاملAutomatic Feature Construction and Optimization for General Game Player
In this paper, we describe our method that automatically constructs evaluation functions without any human analysis of a target game. Such automated constriction of evaluation functions is crucial to develop a general game player that can learn and play an arbitrary instance of a certain class of games. Our approach is to construct features written in logic programs from the game definition and...
متن کاملDistance Features for General Game Playing
General Game Playing (GGP) is concerned with the development of programs that are able to play previously unknown games well. The main problem such a player is faced with is to come up with a good heuristic evaluation function automatically. Part of these heuristics are distance measures used to estimate, e.g., the distance of a pawn towards the promotion rank. However, current distance heurist...
متن کامل